Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs

A graph G is said to be a k-degenerate graph if any subgraph of G contains a vertex of degree at most k. Let κ be any non-negative function on the vertex set of G. We first define a κ-degenerate graph. Next we give an efficient algorithm to determine whether a graph is κ-degenerate. We revisit the concept of dynamic monopolies in graphs. The latter notion is used in formulation and analysis of ...

متن کامل

Vertex partitions and maximum degenerate subgraphs

Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In this work, we prove that G has a vertex partition {S1,S2} such that G[S1] is a maximum order (p1 − 1)degenerate subgraph of G and G[S2] is a (p2 − 1)-degenerate subgraph, where G[Si] denotes the graph induced by the set Si in G...

متن کامل

Remarks on dynamic monopolies with given average thresholds

Dynamic monopolies in graphs have been studied as a model for spreading processes within networks. Together with their dual notion, the generalized degenerate sets, they form the immediate generalization of the classical notions of vertex covers and independent sets in a graph. We present results concerning dynamic monopolies in graphs of given average threshold values extending and generalizin...

متن کامل

Large induced degenerate subgraphs

A graph H is d-degenerate if every subgraph of it contains a vertex of degree smaller than d. For a graph G, let ad(G) denote the maximum number of vertices of an induced d-degenerate subgraph of G. Sharp lowers bounds for %(G) in terms of the degree sequence of G are obtained, and the minimum number of edges of a graph G with n vertices and ~2(G) < m is determined precisely for all m < n.

متن کامل

Maximum Principle and generalized principal eigenvalue for degenerate elliptic operators

We characterize the validity of the Maximum Principle in bounded domains for fully nonlinear degenerate elliptic operators in terms of the sign of a suitably defined generalized principal eigenvalue. Here, the maximum principle refers to the property of non-positivity of viscosity subsolutions of the Dirichlet problem. The new notion of generalized principal eigenvalue that we introduce here al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2013

ISSN: 0166-218X

DOI: 10.1016/j.dam.2013.04.012